Service Guarantees for Window Flow Control
نویسندگان
چکیده
After presenting some new insight into the concept of \service curves," we derive a \service curve guarantee" for a window ow control protocol with cross-traac characterized by burstiness constraints. Our approach is convenient for studying the end-to-end behavior of hop-by-hop window ow control, and has an interesting relationship with a linear feedback system under the \min-plus" algebra. For aane burstiness constraints on the cross-traac, we nd that a window size proportional to the sum of the burstiness parameters of the cross-traac and the user bandwidth delay product is suucient to maximize guaranteed throughput. In addition, we nd that buuers need not be as large as window sizes for lossless operation with large propagation delays. 1 System Model We will consider the two server system depicted in Figure 1, which models a window ow protocol. Traac from a source is generated according to a function of time R 0 , called a rate function, such that R 0 (t) is the instantaneous rate at which traac is being generated at time t. The traac from the source feeds a buuer, called the rst buuer. Traac departs the rst buuer according to the rate function R 1. We assume that the system is empty at time 0. Let B 1 (t) denote the amount of traac held in the rst buuer at time t. Thus B 1 (t) = Z t 0 R 0 ()dd ? Z t 0 R 1 ()dd : (1) A server, called the rst server, governs the rate R 1 at which traac departs the rst buuer. The server has a transmission capacity of C bits/sec, so that R 1 (t) C for all t. In fact, the rst server handles other sources of traac, called \cross-traac," at time t at rate I 1 (t), where 0 I 1 (t) C; thus R 1 (t) C ? I 1 (t). Traac departs the rst buuer at rate R 1 (t) and feeds a \network element", N f , which serves traac in a FIFO manner at rate R f (t). Recalling that the system is empty at time 0, the amount of traac held in N f at time t is thus B f (t) = Z t 0 R 1 ()dd ? Z t 0 R f ()dd : (2) Network element N f feeds another buuer, called the second buuer. Traac departs the second buuer …
منابع مشابه
Service Guarantees for Joint Scheduling and Flow Control
We consider a general mesh network with multiple traf-c streams subject to window ow control on a per hop, per stream basis. Scheduling at each server is governed by \service curve" requirements. We establish lower bounds on the window sizes such that each stream receives pre-speciied service guarantees.
متن کاملCall admission control for IEEE 802.11 contention access mechanism
This paper proposes an admission control algorithm that enables the upcoming IEEE 802.11e contention based Enhanced Distributed Channel Access (EDCA) to provide quantitative bandwidth guarantees for Wireless Local Area Networks (WLANs), rather than a relative prioritized service. The algorithm estimates the throughput that flows would achieve if a new flow with certain parameters was admitted, ...
متن کاملA New per-Class Flow Fixed Proportional Differentiated Service for Multi-service Wireless LAN
In this paper, we propose a new per-CLAss Flow fixed proportional differentiated service model (CLAF) and a companion medium access control scheme for multi-service wireless LANs (WLANs). The scheme is based on the IEEE 802.11 framework. Different from conventional relative differentiated service, in CLAF, a fixed bandwidth quality ratio is guaranteed on per-class per-flow basis regardless of t...
متن کاملMatrix extensions of the filtering theory for deterministic traffic regulation and service guarantees
In this paper, we extend the ltering theory in 6] for deterministic traac regulation and service guarantees to the matrix setting. Such an extension enables us to model telecom-munication networks as linear systems with multiple inputs and multiple outputs under the (min; +)-algebra. Analogous to the scalar setting, there is an associated calculus in the matrix setting, including feedback, conc...
متن کاملScheduling of Multiple Autonomous Guided Vehicles for an Assembly Line Using Minimum Cost Network Flow
This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra assembly line) and among station...
متن کاملAchieving Delay Guarantees in Ad Hoc Networks Using Distributed Contention Window Adaptation
In this paper, we propose a new protocol, named DDA (Distributed Delay Allocation), which provides average delay guarantees to real-time multimedia applications in wireless ad hoc networks. By adapting the contention window sizes of IEEE 802.11, DDA schedules packets of flows according to their individual delay requirements. The novelty of DDA is that it imposes no control message overhead on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996